A Run-Length Encoding Approach for Path Analysis ofC. elegansSearch Behavior
نویسندگان
چکیده
منابع مشابه
A Run-Length Encoding Approach for Path Analysis of C. elegans Search Behavior
The nematode Caenorhabditis elegans explores the environment using a combination of different movement patterns, which include straight movement, reversal, and turns. We propose to quantify C. elegans movement behavior using a computer vision approach based on run-length encoding of step-length data. In this approach, the path of C. elegans is encoded as a string of characters, where each chara...
متن کاملAsymptotic Analysis of Run-Length Encoding
Gallager and Van Voorhis have found optimal prefix-free codes κ(K) for a random variable K that is geometrically distributed: Pr[K = k] = p(1 − p) for k ≥ 0. We determine the asymptotic behavior of the expected length Ex[#κ(K)] of these codes as p → 0: Ex[#κ(K)] = log2 1 p + log2 log 2 + 2 + f ( log2 1 p + log2 log 2 )
متن کاملRun-length Encoding for Volumetric Texture
With the dramatic increase of 3D imaging techniques, there is a great demand for new approaches in texture analysis of volumetric data. In this paper, we present a new approach for volumetric texture analysis using a runlength encoding matrix and its texture descriptors. We experiment with our approach on the volumetric data generated from two normal Computed Tomography (CT) studies of the ches...
متن کاملRun-length Encoding on Graphics Hardware
In this report, we present a series of improvements to the basic run-length encoding algorithm. Several modified algorithms are generated, from basic CPU single-threaded compression to a highly parallelized version on NVidia CUDA hardware. We also investigated changes to memory access locality in the parallel versions. With a comparison of the various compression times and their corresponding d...
متن کاملCompressing Optimal Paths with Run Length Encoding
We introduce a novel approach to Compressed Path Databases, space efficient oracles used to very quickly identify the first edge on a shortest path. Our algorithm achieves query running times on the 100 nanosecond scale, being significantly faster than state-of-the-art first-move oracles from the literature. Space consumption is competitive, due to a compression approach that rearranges rows an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational and Mathematical Methods in Medicine
سال: 2016
ISSN: 1748-670X,1748-6718
DOI: 10.1155/2016/3516089